Papers with Relation classification
Biomedical Relation Classification by single and multiple source domain adaptation (D19-62)
Copied to clipboard
| Challenge: | Existing supervised systems are highly data-driven and require a lot of effort to label data for a new domain. |
| Approach: | They propose to transfer knowledge from one or more related source domains to another domain to improve relation classification. |
| Outcome: | The proposed model outperforms neural-network based models on biomedical datasets and with contextualized embeddings on 3 biomedically-relevant datasets. |
The RELX Dataset and Matching the Multilingual Blanks for Cross-Lingual Relation Classification (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Current approaches for relation classification are focused on the English language and require lots of training data with human annotations. |
| Approach: | They propose a baseline model based on Multilingual BERT and a new multilingual pretraining setup . they propose 'relationship classification' models that use distant supervision . |
| Outcome: | The proposed model significantly improves the baseline model with distant supervision. |
Relation Classification with Entity Type Restriction (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing methods regard all relations as candidate relations for the two entities, which leads to inappropriate relations being candidate relations. |
| Approach: | They propose a paradigm which exploits entity types to restrict candidate relations by mutual restrictions. |
| Outcome: | The proposed paradigm improves GCN and SpanBERT on a standard dataset by 6.9 and 4.4 F1 points. |
Structure Regularized Neural Network for Entity Relation Classification for Chinese Literature Text (N18-2)
Copied to clipboard
| Challenge: | Existing methods for relation classification have been used in natural language processing. |
| Approach: | They propose a relation classification task for Chinese literature text using a new dataset. |
| Outcome: | The proposed model outperforms the state-of-the-art methods on Chinese literature text. |
Chinese Relation Classification using Long Short Term Memory Networks (L18-1)
Copied to clipboard
| Challenge: | Relation classification is the task to predict semantic relations between pairs of entities in a given text. |
| Approach: | They propose to extract relations between entities in Chinese text using a long-term memory network. |
| Outcome: | The proposed system achieves state-of-the-art F-measure on ACE 2005 corpus . it predicts relations between head entity e h and tail entity t from sentence . |
Neural Relation Classification with Text Descriptions (C18-1)
Copied to clipboard
| Challenge: | State-of-the-art methods for relation classification suffer from data sparsity issue greatly. |
| Approach: | They propose a new neural relation classification method which integrates entities’ text descriptions into deep neural networks models. |
| Outcome: | The proposed method achieves much better experimental results than other state-of-the-art methods on the SemEval 2010 dataset. |
Misleading Relation Classifiers by Substituting Words in Texts (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to generate adversarial examples for relation classification are vulnerable to adversarials. |
| Approach: | They propose a method that uses most important parts of speech to substitute words with synonyms or hyponyms to generate adversarial texts of high quality. |
| Outcome: | The proposed method can generate adversarial texts of high quality and most relationships can be correctly identified in the process of human evaluation. |
Logic-guided Semantic Representation Learning for Zero-Shot Relation Classification (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods to zero-shot relation classification can only identify seen relations . existing methods rely on descriptive information to improve understandability of relation types . |
| Approach: | They propose a logic-guided semantic representation learning model for zero-shot relation classification that builds connections between seen and unseen relations via implicit and explicit semantic representations with knowledge graph embeddings and logic rules. |
| Outcome: | The proposed model can generalize to unseen relation types and achieve promising improvements. |
Vector-Quantized Input-Contextualized Soft Prompts for Natural Language Understanding (2022.emnlp-main)
Copied to clipboard
| Challenge: | Prompt Tuning has been successful as a parameter-efficient method of conditioning large-scale pre-trained language models to perform downstream tasks. |
| Approach: | They propose to use a vector-quantized input-contextualized prompt as an extension to the soft prompt tuning framework to learn contextualization of soft prompt tokens. |
| Outcome: | The proposed prompt outperforms soft prompt tuning by an average margin of 1.19% on various language understanding tasks like SuperGLUE, QA, Relation classification, NER and NLI. |